A Time-Shifting Algorithm for Alleviating Convergence Difficulties at Interior Acoustic Resonance Frequencies
نویسندگان
چکیده
منابع مشابه
A path-following infeasible interior-point algorithm for semidefinite programming
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...
متن کاملStudy of the effect of shape on acoustic performance of micro perforated absorbent at low frequencies
Introduction: Micro-perforated absorbents are one of the structures that are widely used nowadays. The sound absorption mechanism is performed by viscous energy losses in the cavities on the plate. In this study, the acoustic properties of non-flat perforated panels in oblique angle was investigated in numerical method. Material and Methods: This paper examined the effect of the surface shape ...
متن کاملLoss Reduction in Coupled Resonance Surface Acoustic Wave Filters Operating at Ghz Frequencies
s of Publications I–VI I The concept of coupled resonators is applied to synthesize surface-acoustic-wavefilters. Employing two parallel-connected filter tracks, with a frequency shiftimposed between them, a wide passband with low insertion loss together withwell-controlled rejections is achieved. The operation of the two-track device isbased on the mutual interaction of the ind...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملA Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs
An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2021
ISSN: 2076-3417
DOI: 10.3390/app11062701